62 research outputs found

    Maximal and linearly inextensible polynomials

    Full text link
    Let S(n,0) be the set of monic complex polynomials of degree n≥2n\ge 2 having all their zeros in the closed unit disk and vanishing at 0. For p∈S(n,0)p\in S(n,0) denote by ∣p∣0|p|_{0} the distance from the origin to the zero set of p′p'. We determine all 0-maximal polynomials of degree nn, that is, all polynomials p∈S(n,0)p\in S(n,0) such that ∣p∣0≥∣q∣0|p|_{0}\ge |q|_{0} for any q∈S(n,0)q\in S(n,0). Using a second order variational method we then show that although some of these polynomials are linearly inextensible, they are not locally maximal for Sendov's conjecture.Comment: Final version, to appear in Mathematica Scandinavica, 16 pages, no figures, LaTeX2

    Hyperbolicity preservers and majorization

    Get PDF
    The majorization order on \RR^n induces a natural partial ordering on the space of univariate hyperbolic polynomials of degree nn. We characterize all linear operators on polynomials that preserve majorization, and show that it is sufficient (modulo obvious degree constraints) to preserve hyperbolicity.Comment: 4 pages, Published as C. R. Math. Acad. Sci. Paris 348 (2010), 843-84
    • …
    corecore